Sorts the elements in the container from lower to higher. The sorting is performed by comparing the elements in the container in pairs using a sorting algorithm. The comparisons are perfomed using function binaryPredicate, which performs weak strict ordering (this basically means the comparison operation has to be transitive and irreflexive).